Using Formal Logic to Define the Grammar for Memory Transfer Language (MTL) on the mould of Register Transfer Language (RTL) and High Level Languages

نویسنده

  • Leonard J. Mselle
چکیده

This paper revisits visualization as a technique to enhance programming comprehension. It points out that animation, being a machine-driven visualization, is inadequate. Memory Transfer Language (MTL), as a visualization technique which is absolutely programmer-driven is demonstrated and discussed. It is shown that MTL can be plugged into current materials for teaching programming. Register Transfer Language (RTL) combined with high level languages are used as bedrocks on which MTL is formalized.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detection of Stuck at Fault Indigital Circuits at Register Transfer Logic (RTL)

Due to the increasing complexity of modern circuit design, verification has become the major bottleneck of the entire design process. Most efforts are to verify the correctness of the initial Register-Transfer Level (RTL) descriptions written in Hardware Description Language (HDL).Major drawback of high level design methodologies such as RTL can be seen in the following facts. First, they lack ...

متن کامل

Cross-Linguistic Transfer or Target Language Proficiency: Writing Performance of Trilinguals vs. Bilinguals in Relation to the Interdependence Hypothesis

This study explored the nature of transfer among bilingual vs. trilinguals with varying levels of competence in English and their previous languages. The hypotheses were tested in writing tasks designed for 75 high (N= 35) vs. intermediate (N=40) proficient EFL learners with Turkish, Persian, English and Persian, English linguistic backgrounds. Qualitative data were also collected through some ...

متن کامل

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

Specification of Control Flow Properties for Verification of Synthesized VHDL Designs

Behavioral speciications in VHDL contain multiple communicating processes. Register level designs synthesized from these speciications contain a data path represented as a netlist and a controller consisting of multiple communicating synchronous nite state machines. These nite state machines together implement the control ow speciied in and implied by the behavioral speciication in VHDL. This p...

متن کامل

A Probe into Adaptive Transfer across Writing Contexts: A Case of an EGAP Class

In an effort to expand the disciplinary discussions on transfer in L2 writing and because most studies have focused on transfer as reuse and not as an adequate adaptation of writing knowledge in new contexts, the present study as the first of its kind aimed to explore the issue of adaptive transfer in an English for General Academic Purposes (EGAP) writing course. The study thus focused on type...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011